Phase transformations surfaces and exact energy lower bounds
نویسندگان
چکیده
منابع مشابه
Binding Surfaces and Structural Phase Transformations
We have calculated binding surfaces for cla changes (along the Bain path) and changes of the atomic volume of metallic systems undergoing martensitic transformations. We find characteristic differences between the surfaces of nonmagnetic systems (with a close packed low temperature structure) and magnetic systems (with a less close packed low temperature structure). The ab initio calculations h...
متن کاملPseudoentropy: Lower-Bounds for Chain Rules and Transformations
Computational notions of entropy have recently found many applications, including leakageresilient cryptography, deterministic encryption or memory delegation. The two main types of results which make computational notions so useful are (1) Chain rules, which quantify by how much the computational entropy of a variable decreases if conditioned on some other variable (2) Transformations, which q...
متن کامل11. Kernel Lower Bounds - COMP6741: Parameterized and Exact Computation
Fixed-parameter tractability Definition 2. A parameterized problem Π is fixed-parameter tractable (FPT) if there is an algorithm solving Π in time f(k) · poly(n), where n is the instance size, k is the parameter, poly is a polynomial function, and f is a computable function. Theorem 3. Let Π be a decidable parameterized problem. Π has a kernelization ⇔ Π is FPT. 2 A kernel for Hamiltonian Cycle...
متن کاملExact upper and lower bounds on the misclassification probability
Abstract. A lower bound on the misclassification probability for a finite number of classes is obtained in terms of the total variation norms of the differences between the sub-distributions over the classes. This bound, which is shown to be exact in a certain rather strong sense, is based on an exact upper bound on the difference between the maximum and the mean of a finite set of real numbers...
متن کاملTighter Lower Bounds on the Exact Complexity of String Matching
The paper considers the exact number of character comparisons needed to nd all occurrences of a pattern of length m in a text of length n using on-line and general algorithms. For on-line algorithms, a lower bound of about (1 + 9 4(m+1)) n character comparisons is obtained. For general algorithms, a lower bound of about (1 + 2 m+3) n character comparisons is obtained. These lower bounds complem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering Science
سال: 2016
ISSN: 0020-7225
DOI: 10.1016/j.ijengsci.2015.10.004